- automated deduction
- автоматизированный логический вывод (
*в экспертных системах*)

*English-Russian dictionary of computer science and programming.
2013.*

- automated deduction
- автоматизированный логический вывод (
*в экспертных системах*)

*English-Russian dictionary of computer science and programming.
2013.*

**Conference on Automated Deduction**— The Conference on Automated Deduction (CADE) is the premier academic conference on automated deduction and related fields. The first CADE was organized in 1974 at the Argonne National Laboratory near Chicago. Most CADE meetings have been held in… … Wikipedia**Automated reasoning**— is an area of computer science dedicated to understand different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated… … Wikipedia**Automated theorem proving**— (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… … Wikipedia**International Joint Conference on Automated Reasoning**— IJCAR is a series of conferences on the topics of automated reasoning, automated deduction, and related fields. It is organized semi regularly as a merger of other meetings. IJCAR replaces those independent conferences in the years it takes place … Wikipedia**Sequent calculus**— In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as … Wikipedia**Condensed detachment**— (Rule D) is a method of finding the most general possible conclusion given two formal logical statements. It was developed by the Irish logician Carew Meredith in the 1950s and inspired by the work of Łukasiewicz. Contents 1 Informal description… … Wikipedia**SNARK theorem prover**— SNARK, SRI s New Automated Reasoning Kit, is a theorem prover for multi sorted first order logic intended for applications in artificial intelligence and software engineering. SNARK s principal inference mechanisms are resolution and… … Wikipedia**List of computer science conferences**— This is a list of academic conferences in computer science. Most of these academic conferences are annual or bi annual events.The order with which the conferences are listed in their respective fields corresponds to a rough and non authoritative… … Wikipedia**Many-valued logic**— In logic, a many valued logic (also multi or multiple valued logic) is a propositional calculus in which there are more than two truth values. Traditionally, in Aristotle s logical calculus, there were only two possible values (i.e., true and… … Wikipedia**Herbrand Award**— The Herbrand Award for Distinguished Contributions to Automated Deduction is an award given by CADE Inc. (although it predates the formal incorporation of CADE) to honour persons or groups for important contributions to the field of automated… … Wikipedia**SPASS theorem prover**— SPASS is an automated theorem prover for first order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus.References*Citation last1 = Weidenbach | first1 = Christoph last2 = Schmidt | … Wikipedia